Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors

family of 6-regular graphs, called hexagonal meshes or H-meshes, is considered n H as a multiprocessor interconnection network. Processing nodes on the periphery of a-mesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped H-mesh is shown to be of O(p), where p is the number of nodes in the 1/2 o t H-mesh. An elegant, distributed routing scheme is developed for wrapped H-meshes s hat each node in an H-mesh can compute shortest paths from itself to any other node p with a straightforward algorithm of O(1) using the addresses of the source-destination air only, i.e., independent of the network's size. This is in sharp contrast with those d previously known algorithms that rely on using routing tables. Furthermore, we also evelop an efficient point-to-point broadcasting algorithm for the H-meshes, which is proved to be optimal in the number of required communication steps. The wrapped H-meshes are compared against some other existing multiprocessor-p interconnection networks, such as hypercubes, trees, and square meshes. The com arison reinforces the attractiveness of the H-mesh architecture. Any opinions, findings, and recommendations expressed in this publi ation are those of the authors and do not necessarily reflect the view of the ONR.